The radius of k-connected planar graphs with bounded faces
نویسندگان
چکیده
We prove that if G is a 3-connected plane graph of order p, maximum face length l and radius rad(G), then the bound rad(G) ≤ p 6 + 5l 6 + 2 3 holds. For constant l, our bound is shown to be asymptotically sharp and improves on a bound by Harant (1990) [6]. Furthermore we extend these results to 4and 5-connected planar graphs. © 2012 Published by Elsevier B.V.
منابع مشابه
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
It is well known that the spectral radius of a tree whose maximum degree is D cannot exceed 2 √ D − 1. In this paper we derive similar bounds for arbitrary planar graphs and for graphs of bounded genus. It is proved that a the spectral radius ρ(G) of a planar graph G of maximum vertex degree D ≥ 4 satisfies √D ≤ ρ(G) ≤ √8D − 16 + 7.75. This result is best possible up to the additive constant—we...
متن کاملDistributed Domination on Graph Classes of Bounded Expansion
We provide a new constant factor approximation algorithm for the (connected) distance-r dominating set problem on graph classes of bounded expansion. Classes of bounded expansion include many familiar classes of sparse graphs such as planar graphs and graphs with excluded (topological) minors, and notably, these classes form the most general subgraph closed classes of graphs for which a sequent...
متن کاملNodally 3-connected planar graphs and barycentric embeddings
An interesting question about planar graphs is whether they admit plane embeddings in which every bounded face is convex. Stein [10] gave as a necessary and sufficient condition that every face boundary be a simple cycle and every two bounded faces meet in a connected set, with an extra condition about the number of vertices on the outer face. Tutte [12] gave a similar characterisation, and lat...
متن کاملOn Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces
Intuitevly, a graph H is light in a class G of graphs when H is a subgraph of some member of G and for every G ∈ G if G contains H as a subgraph, there is also an occurence H ′ of H in G such that the degrees of vertices of H ′ in G are bounded by some constant. Characterizing light graphs in various subclasses of plane graphs attracted many researchers in recent years. We focus on the class P(...
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 312 شماره
صفحات -
تاریخ انتشار 2012